An FPGA-based Priority Packet Queues

On packet marking at priority queues

This note concerns charging, rate control and routing for a communication network using priority mechanisms at queues. It is argued that by appropriately marking packets at overloaded resources, end-systems can be provided with the information necessary to balance load across different routes and priorities. Keywords—Congestion pricing, differentiated services, priority queues, rate control, ro...

Skiplist-Based Concurrent Priority Queues

This paper addresses the problem of designing scalable concurrent priority queues for large scale multiprocessors – machines with up to several hundred processors. Priority queues are fundamental in the design of modern multiprocessor algorithms, with many classical applications ranging from numerical algorithms through discrete event simulation and expert systems. While highly scalable approac...

Gibbens and Kelly : on Packet Marking at Priority Queues

Priority Queues Based on Braun Trees

This theory implements priority queues via Braun trees. Insertion and deletion take logarithmic time and preserve the balanced nature of Braun trees.

Time Dependent Priority Queues

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...